Singlet states and the estimation of eigenstates and eigenvalues of an unknown Controlled-U gate

We consider several problems that involve finding the eigenvalues and generating the eigenstates of unknown unitary gates. We first examine Controlled-U gates that act on qubits, and assume that we know the eigenvalues. It is then shown how to use singlet states to produce qubits in the eigenstates of the gate. We then remove the assumption that we know the eigenvalues and show how to both find the eigenvalues and produce qubits in the eigenstates. Finally, we look at the case where the unitary operator acts on qutrits and has eigenvalues of 1 and -1, where the eigenvalue 1 is doubly degenerate. The eigenstates are unknown. We are able to use a singlet state to produce a qutrit in the eigenstate corresponding to the -1 eigenvalue.Comment: Latex, 10 pages, no figure

Expected Performance of CryoArray

WIMP-nucleon cross sections below 10^(-9) pb may be probed by ton-scale experiments with low thresholds and background rates ~20 events per year. An array of cryogenic detectors ("CryoArray") could perform well enough to reach this goal. Sufficient discrimination and background suppression of photons has already been demonstrated. Reduction of neutron backgrounds may be achieved by siting the experiment deep enough. Removal of the surface-electron backgrounds alone has not yet been demonstrated, but the reductions required even for this troublesome background are quite modest and appear achieveable.Comment: 4 pages, 2 figures. Talk at DM2002 Conference, Marina del Rey, CA, Feb 20-22, 200

Efficient Algorithms for Universal Quantum Simulation

A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum simulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed

Quantum search by measurement

We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.Comment: 8 pages, 2 figure

Efficiency of free energy calculations of spin lattices by spectral quantum algorithms

Quantum algorithms are well-suited to calculate estimates of the energy spectra for spin lattice systems. These algorithms are based on the efficient calculation of the discrete Fourier components of the density of states. The efficiency of these algorithms in calculating the free energy per spin of general spin lattices to bounded error is examined. We find that the number of Fourier components required to bound the error in the free energy due to the broadening of the density of states scales polynomially with the number of spins in the lattice. However, the precision with which the Fourier components must be calculated is found to be an exponential function of the system size.Comment: 9 pages, 4 figures; corrected typographical and minor mathematical error

Simulating Physical Phenomena by Quantum Networks

Physical systems, characterized by an ensemble of interacting elementary constituents, can be represented and studied by different algebras of observables or operators. For example, a fully polarized electronic system can be investigated by means of the algebra generated by the usual fermionic creation and annihilation operators, or by using the algebra of Pauli (spin-1/2) operators. The correspondence between the two algebras is given by the Jordan-Wigner isomorphism. As we previously noted similar one-to-one mappings enable one to represent any physical system in a quantum computer. In this paper we evolve and exploit this fundamental concept in quantum information processing to simulate generic physical phenomena by quantum networks. We give quantum circuits useful for the efficient evaluation of the physical properties (e.g, spectrum of observables or relevant correlation functions) of an arbitrary system with Hamiltonian $H$.Comment: 44 pages, 15 psfigur

A quantum gate array can be programmed to evaluate the expectation value of any operator

A programmable gate array is a circuit whose action is controlled by input data. In this letter we describe a special--purpose quantum circuit that can be programmed to evaluate the expectation value of any operator $O$ acting on a space of states of $N$ dimensions. The circuit has a program register whose state $|\Psi(O)>_P$ encodes the operator $O$ whose expectation value is to be evaluated. The method requires knowledge of the expansion of $O$ in a basis of the space of operators. We discuss some applications of this circuit and its relation to known instances of quantum state tomography.Comment: 4 pages, 3 figures include

Quantum key distribution without alternative measurements

Entanglement swapping between Einstein-Podolsky-Rosen (EPR) pairs can be used to generate the same sequence of random bits in two remote places. A quantum key distribution protocol based on this idea is described. The scheme exhibits the following features. (a) It does not require that Alice and Bob choose between alternative measurements, therefore improving the rate of generated bits by transmitted qubit. (b) It allows Alice and Bob to generate a key of arbitrary length using a single quantum system (three EPR pairs), instead of a long sequence of them. (c) Detecting Eve requires the comparison of fewer bits. (d) Entanglement is an essential ingredient. The scheme assumes reliable measurements of the Bell operator.Comment: REVTeX, 5 pages, 2 figures. Published version with some comment

Steady-State Properties of Single-File Systems with Conversion

We have used Monte-Carlo methods and analytical techniques to investigate the influence of the characteristic parameters, such as pipe length, diffusion, adsorption, desorption and reaction rate constants on the steady-state properties of Single-File Systems with a reaction. We looked at cases when all the sites are reactive and when only some of them are reactive. Comparisons between Mean-Field predictions and Monte-Carlo simulations for the occupancy profiles and reactivity are made. Substantial differences between Mean-Field and the simulations are found when rates of diffusion are high. Mean-Field results only include Single-File behavior by changing the diffusion rate constant, but it effectively allows passing of particles. Reactivity converges to a limit value if more reactive sites are added: sites in the middle of the system have little or no effect on the kinetics. Occupancy profiles show approximately exponential behavior from the ends to the middle of the system.Comment: 15 pages, 20 figure

Quantum Computing of Quantum Chaos in the Kicked Rotator Model

We investigate a quantum algorithm which simulates efficiently the quantum kicked rotator model, a system which displays rich physical properties, and enables to study problems of quantum chaos, atomic physics and localization of electrons in solids. The effects of errors in gate operations are tested on this algorithm in numerical simulations with up to 20 qubits. In this way various physical quantities are investigated. Some of them, such as second moment of probability distribution and tunneling transitions through invariant curves are shown to be particularly sensitive to errors. However, investigations of the fidelity and Wigner and Husimi distributions show that these physical quantities are robust in presence of imperfections. This implies that the algorithm can simulate the dynamics of quantum chaos in presence of a moderate amount of noise.Comment: research at Quantware MIPS Center http://www.quantware.ups-tlse.fr, revtex 11 pages, 13 figs, 2 figs and discussion adde